Generating elements of orders dividing p 6 ± p 5 + p 4 ± p 3 + p 2 ± p + 1 Maciej

نویسندگان

  • Maciej Grześkowiak
  • Adam Mickiewicz
چکیده

In this paper we propose an algorithm for computing large primes p and q such that q divides p + p + p + p + p + p + 1 or p − p + p − p + p − p + 1. Such primes are the key parameters for the cryptosystem based on the 7th order characteristic sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating elements of orders dividing p 6 ± p 5 + p 4 ± p 3 + p 2 ± p + 1 Maciej Grześkowiak ∗

In this paper we propose an algorithm for computing large primes p and q such that q divides p + p + p + p + p + p + 1 or p − p + p − p + p − p + 1. Such primes are the key parameters for the cryptosystem based on the 7th order characteristic sequences.

متن کامل

Generating elements of orders dividing p6 ± p5 + p4 ± p3 + p2 + p ± 1

In this paper we propose an algorithm for computing large primes p and q such that q divides p + p + p + p + p + p + 1 or p − p + p − p + p − p + 1. Such primes are the key parameters for the cryptosystem based on the 7th order characteristic sequences.

متن کامل

Principal Blocks and the Steinberg Character

We determine the finite simple groups of Lie type of characteristic p, for which the Steinberg character lies in the principal `-block for every prime ` 6= p dividing the order of the group. In [1, Corollary 4.4], Bessenrodt, Malle, and Olsson determine the finite simple groups of Lie type having a non-trivial irreducible character which is in the principal `-block for all primes ` dividing the...

متن کامل

SOME REMARKS ON a($(m))

It was conjectured in 1964 by A. Makowski & A. Schinzel [4] that, for every natural number vim). i • >-n " 2 " They remarked also that even the weaker result (i) i n f ^ W) > 0 (2) n is still unproved. Carl Pomerance [5] gave a proof of (2). Also S. W. Graham et al. [2] stated in the abstract, their result, .5 7 6 < l i m j r f « < U m s u p ^ i)) < 1, where P m is the product of the first m pr...

متن کامل

Formal Modular Seminvariants

We construct a generating set for the ring of invariants for the four and five dimensional indecomposable modular representations of a cyclic group of prime order. We then observe that for the four dimensional representation the ring of invariants is generated in degrees less than or equal to 2p − 3, and for the five dimensional representation the ring of invariants is generated in degrees less...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017